Optimal Probabilistic Scheduling in Time Slotted Multiple Access
نویسندگان
چکیده
منابع مشابه
Asymptotically Optimal Scheduling in Cognitive Multiple-Access Channel
This paper considers a cognitive (secondary) multiple-access network with n transmitters, subject to a set of interference power constraints imposed by a primary system with Mp transmitters and Np receivers. We aim to simultaneously achieve two goals: opportunistically mitigate the interference on the primary while harvesting multiuser diversity gains in the secondary. For this purpose, a two-s...
متن کاملPerformance of CDMA slotted ALOHA multiple access with multiuser detection
of this work is to assess the impact of such MU detecPacketized random access based on Code Division Multiple Access (CDMA) is considered. Our primary aim is to assess the impact of (uncoded) multi-user (MU) detectors on the performance of CDMA with slotted ALOHA. The impact of respective multiple packet reception capability for the matched filter and MMSE detector on delay/throughput improveme...
متن کاملTime-Slotted Multiuser MIMO Systems: Beamforming and Scheduling Strategies
We investigate the problem of scheduling for the uplink of a time-slotted multiuser multiple-input multiple-output (MIMO) system with sum capacity as the performance metric. We first consider scheduling users’ transmissions for fixed transmit beamformers. Upper bounds for the sum capacity of the time-slotted system with the optimum scheduler are found via relaxing a set of structural constraint...
متن کاملOptimal Offline Packet Scheduling in Energy Harvesting 2-user Multiple Access Channel with Common Data
Energy harvesting with the optimum power consumption and packet scheduling increase the lifetime and sustainability of the wireless sensor networks (WSNs) leading to green communications. Optimal packet scheduling solutions available for 2-user multiple-access channel (MAC) systems with energy harvesting transmitters do not consider the common data observed when collected sensor data is spatial...
متن کاملTime-Splitting Multiple-Access
It is shown that the encoding/decoding problem for any asynchronous M -user memoryless multiple-access channel can be reduced to corresponding problems for at most 2M 1 single-user memoryless channels. This is done via a method called time-splitting multiple-access which is closely related to a recently developed method called rate-splitting multiple access. It is also related to to multilevel ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: WSEAS TRANSACTIONS ON COMMUNICATIONS
سال: 2021
ISSN: 2224-2864,1109-2742
DOI: 10.37394/23204.2020.19.24